Kolmogorov's algorithmic complexity and its probability interpretation in quantum gravity
نویسندگان
چکیده
منابع مشابه
Algorithmic Complexity in Cosmology and Quantum Gravity
In this article we use the idea of algorithmic complexity (AC) to study various cosmological scenarios, and as a means of quantizing the gravitational interaction. We look at 5D and 7D cosmological models where the Universe begins as a higher dimensional Planck size spacetime which fluctuates between Euclidean and Lorentzian signatures. These fluctuations are governed by the AC of the two diffe...
متن کاملProbability, algorithmic complexity, and subjective randomness
We present a statistical account of human randomness judgments that uses the idea of algorithmic complexity. We show that an existing measure of the randomness of a sequence corresponds to the assumption that non-random sequences are generated by a particular probabilistic finite state automaton, and use this as the basis for an account that evaluates randomness in terms of the length of progra...
متن کاملAlgorithmic complexity of quantum capacity
Recently the theory of communication developed by Shannon has been extended to the quantum realm by exploiting the rules of quantum theory. This latter stems on complex vector spaces. However complex (as well as real) numbers are just idealizations and they are not available in practice where we can only deal with rational numbers. This fact naturally leads to the question of whether the develo...
متن کاملAlgorithmic complexity and entanglement of quantum states.
We define the algorithmic complexity of a quantum state relative to a given precision parameter, and give upper bounds for various examples of states. We also establish a connection between the entanglement of a quantum state and its algorithmic complexity.
متن کاملRailway Delay Management: Exploring Its Algorithmic Complexity
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If there is a single delayed train and passengers transfer at most twice along fixed routes, or if the railway network has a tree structure, the problem can be solved by reduction to min-cut problems. For delayed passeng...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Classical and Quantum Gravity
سال: 1998
ISSN: 0264-9381,1361-6382
DOI: 10.1088/0264-9381/15/3/011